Some Recent and Not-So-Recent Upper and Lower Bounds in Arithmetic Circuit Complexity
نویسندگان
چکیده
From 08.11.06 to 10.11.06, the Dagstuhl Seminar 06451 Circuits, Logic, and Games was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Arithmetic Circuits: A survey of recent results and open questions
A large class of problems in symbolic computation can be expressed as the task of computing some polynomials; and arithmetic circuits form the most standard model for studying the complexity of such computations. This algebraic model of computation attracted a large amount of research in the last five decades, partially due to its simplicity and elegance. Being a more structured model than Bool...
متن کاملSome remarks on the arithmetic-geometric index
Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.
متن کاملOn the total version of geometric-arithmetic index
The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.
متن کاملOn the Complexity of Bilinear Forms∗
This paper provides some new lower and upper bounds on computing bilinear forms by arithmetic circuits. The complexity measures considered are circuit size, formula size and time-space trade-offs.
متن کاملTropical Complexity, Sidon Sets, and Dynamic Programming
Many dynamic programming algorithms for discrete 0-1 optimization problems are just special (recursively constructed) tropical (min,+) or (max,+) circuits. A problem is homogeneous if all its feasible solutions have the same number of 1s. Jerrum and Snir [JACM 29 (1982), pp. 874– 897] proved that tropical circuit complexity of homogeneous problems coincides with the monotone arithmetic circuit ...
متن کامل